On some identities for the Fibonomial coefficients via generating function

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The p-adic Order of Some Fibonomial Coefficients

In this paper, we consider the Fibonomial coefficients, a natural generalization of the binomial coefficients. We generalize a 2013 result of the authors and J. Sellers by proving an exact divisibility result for Fibonomial coefficients involving powers of primes and confirming a recent conjecture.

متن کامل

Generalization of Fibonomial Coefficients

Following Lucas and then other Fibonacci people Kwaśniewski had introduced and had started ten years ago the open investigation of the overall F -nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients with a new unified combinatorial interpretation expressed in terms of cobweb posets’ partitions and tilings of discrete hyperboxes. In this paper, we deal ...

متن کامل

Modified k-Pell Sequence: Some Identities and Ordinary Generating Function

Some identities of the k-Pell-Lucas sequence and their relationship to the Modified k-Pell sequence allow us to obtain some identities for Modified k-Pell numbers. Also the ordinary generating function for the Modified k-Pell sequence and another expression for the general term of the sequence, using the ordinary generating function, is provided. Mathematics Subject Classification 2010: 11B37, ...

متن کامل

On inversion formulas and Fibonomial coefficients

A research problem for undergraduates and graduates is being posed as a cap for the prior antecedent regular discrete mathematics exercises. [Here cap is not necessarily CAP=Competitive Access Provider, though nevertheless ...] The object of the cap problem of final interest i.e. array of fibonomial coefficients and the issue of its combi-natorial meaning is to be found in A.K.Kwa´sniewski's so...

متن کامل

On Divisibility of Fibonomial Coefficients by 3

Let Fn be the nth Fibonacci number. For 1 ≤ k ≤ m − 1 let

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2007

ISSN: 0166-218X

DOI: 10.1016/j.dam.2007.05.003